public class Test {
    /**
     * Map和Set
     * @param args
     *      1.搜索树
     *      2.搜索
     */
    /**
     * 搜索树
     * @param args
     *      1.概念
     *      2.查找
     *      3.插入
     *      4.删除
     */
    public static void main(String[] args) {
        BinarySearchTree binarySearchTree = new BinarySearchTree();
        binarySearchTree.insert(10);
        binarySearchTree.insert(5);
        binarySearchTree.insert(19);
        System.out.println(binarySearchTree.search(10));
        binarySearchTree.remove(10);
        System.out.println();
    }
    public static void main1(String[] args) {
        /**
         * 概念
         *      为空或左子树不为空必然所有树小于根,右子树不为空必然所有数大于根,左右子树也均为二叉搜索树
         */

    }
}
